Posts tagged with Zero to Hero
Sep 11 2025
The fast and slow pointer technique is an extension of the two-pointer concept. Instead of moving both pointers at the same speed, one pointer moves one step at a time (slow), while the other moves two steps at a time (fast).
Sep 10 2025
A linked list is a dynamic data structure made up of nodes. Each node contains data and a pointer (or reference) to the next node.
Sep 8 2025
HashMaps (also called dictionaries or hash tables) are fundamental data structures that allow for fast average-time operations for insert, delete, and lookup all in O(1).
Sep 7 2025
The two-pointer technique refers to an algorithm that uses two pointers (indices) to navigate within a data structure such as an array or linked list.
Dec 26 2024
Today's session in the 'React: Zero to Hero' series focused on mastering Event Handling and Conditional Rendering.
Dec 8 2024
Learned the two foundational concepts—state and props—in today's 'React: Zero to Hero' series.
Dec 7 2024
Learn how to set up your first app using modern tools like Vite or Create React App, understand the folder structure, and create your first component with clean ES6 syntax.
Dec 6 2024
Join the ‘React: Zero to Hero’ series, where we start from scratch and guide you through React’s basics to advanced topics like hooks, state management, and performance optimization.
Hi, I'm Samarth. I'm a software engineer based in Los Angeles. You can follow me on Twitter, see some of my work on GitHub, or read more about me on LinkedIn.
